A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem
نویسندگان
چکیده
منابع مشابه
A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem
Article history: Received December 10, 2014 Received in revised format: January 4, 2015 Accepted February 20, 2015 Available online February 24 2015 This paper presents a new search methodology for different sizes of 0-1 Knapsack Problem (KP). The proposed methodology uses a modified scatter search as a meta-heuristic algorithm. Moreover, rough set theory is implemented to improve the initial f...
متن کاملSolving the 0-1 Multidimensional Knapsack Problem with Resolution Search
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0–1 Multidimensional Knapsack Problem. This algorithm is able to prove large–scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.
متن کاملSolving 0-1 knapsack problem by a novel global harmony search algorithm
This paper proposes a novel global harmony search algorithm (NGHS) to solve 0–1 knapsack problems. Theproposed algorithm includes two important operations: positionupdating andgeneticmutationwith a small probability. The former enables the worst harmony of harmony memory to move to the global best harmony rapidly in each iteration, and the latter can effectively prevent theNGHS from trapping in...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولIntegrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems
This paper deals with the problem of inaccuracy of the solutions generated by metaheuristic approaches for bi-criteria {0,1}-knapsack problems. A hybrid approach which combines systematic and heuristic search is proposed to reduce that inaccuracy in the context of a scatter search method. The components of the method are used to determine regions in the decision space to be systematically searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Decision Science Letters
سال: 2015
ISSN: 1929-5804,1929-5812
DOI: 10.5267/j.dsl.2015.2.001